Variables in Concept Graphs

نویسنده

  • Frithjof Dau
چکیده

A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose. In contrast to that, in conceptual graphs, a single syntactical item, the generic marker ‘∗’ is used. Nonetheless, sometimes conceptual graphs with variables have to be considered. If the generic marker is replaced by variables, it has to be investigated how this syntactical difference is reflected by the semantics and transformation rules for conceptual graphs. In this paper, this task is carried out for the system of concept graph with cuts (CGwCs). Two different classes of CGwCs with variables is introduced, and for both, a semantics and an adequate calculus for CGwCs is provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

On Generalized Coprime Graphs

Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

متن کامل

Fuzzy Forcing Set on Fuzzy Graphs

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

متن کامل

Extended graphs based on KM-fuzzy metric spaces

This paper,  applies the concept  of KM-fuzzy metric spaces and  introduces a novel concept of KM-fuzzy metric  graphs based on KM-fuzzy metric spaces.  This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to  extend   the concept of KM-fuzzy metric spaces to  a larger ...

متن کامل

Incidence dominating numbers of graphs

In this paper, the concept of incidence domination number of graphs  is introduced and the incidence dominating set and  the incidence domination number  of some particular graphs such as  paths, cycles, wheels, complete graphs and stars are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005